package fun.coding.sort;

public interface SortAlgorithm {

    // quick sort needs a partition() to find the pivot
    void quickSort(int[] array, int left, int right);
    
    // merge sort needs a merge (requires extra space) to merge two sub arrays.
    void mergeSort(int[] array, int left, int right);
    
    void insertionSort(int[] array);
    
    void heapSort(int[] array);
}
